Multithread parallelization of Lepp-bisection algorithms
نویسندگان
چکیده
منابع مشابه
Multithread Lepp-Bisection Algorithm for Tetrahedral Meshes
Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...
متن کاملA Parallelization of State-of-the-Art Graph Bisection Algorithms on the Grid
We have parallelized Reactive Randomized Tabu Search (RRTS) graph partition algorithm and adapted it to the grid environment. Speedup is achieved by parallelizing scoring phase of RRTS. We also introduced two techniques: multilevel scoring and parallel initialization. By using multilevel scoring, tabu lengths are highly tuned to adapt large graphs. And by parallel initialization, dispersed comp...
متن کاملGraph bisection algorithms
In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds...
متن کاملParallelization of Modular Algorithms
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular computation of the associated primes of a zero–dimensional ideal and describe their parallel implementation in Singular. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem ...
متن کاملThe study of distributed computing algorithms by multithread applications
The material in this note is used as an introduction to distributed algorithms in a four year course on software and automatic control system in the computer technology department of the Komsomolsk-on-Amur state technical university. All our the program examples are written in Borland C/C++ 5.02 for Windows 95/98/2000/NT/XP, and hence suit to compile and execute by Visual C/C++. We consider the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2012
ISSN: 0168-9274
DOI: 10.1016/j.apnum.2011.07.011